Steiner tree problem - PDFSEARCH.IO - Document Search Engine

Steiner tree problem
Results: 87

#	Item
11	Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India, Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-12-11 12:58:32 Graph theory Computational complexity theory Mathematics NP-complete problems Spanning tree Steiner tree problem Operations research Knowledge representation Edsger W. Dijkstra Minimum spanning tree Travelling salesman problem Approximation algorithm
12	CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-18 01:28:39 Graph theory Mathematics NP-complete problems Matroid theory Steiner tree problem Bipartite graph Eulerian path Graph Degree Ear decomposition Directed graph Cycle
13	A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-04-27 05:26:50 Computational complexity theory Graph theory Mathematics NP-complete problems Steiner tree problem Approximation algorithm APX Spanning tree Optimization problem Wiener connector Travelling salesman problem
14	CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-01 15:15:38 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Operations research Combinatorial optimization NP-hard problems Online algorithm Steiner tree problem Minimum spanning tree Travelling salesman problem
15	Network Design via Core Detouring for Problems Without a Core Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 NP-complete problems APX Joint Electronics Type Designation System Steiner tree problem Gupta
16	Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-11-30 21:17:11 Spanning tree NP-complete problems Routing algorithms Edsger W. Dijkstra Combinatorial optimization Steiner tree problem Minimum spanning tree Shortest path problem Eulerian path Algorithm Randomized algorithm Matching
17	Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni & Thomas Rothvoß Department of Mathematics, M.I.T. Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 NP-complete problems Approximation algorithms Operations research Facility location problem Combinatorial optimization Steiner tree problem APX Draft:Sub-linear time algorithm Planar separator theorem
18	CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-04 19:18:44 NP-complete problems Edsger W. Dijkstra Spanning tree Matroid theory Operations research Online algorithm Steiner tree problem Matroid Shortest path problem Algorithm Travelling salesman problem Greedy algorithm
19	21st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 2015 www.mssanz.org.au/modsim2015 Integrated planning of linear infrastructure and conservation offsets J. D. Bunton a, A. T Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2015-12-13 21:36:42 Operations research Environmental economics Carbon finance Carbon offset Renewable energy Biodiversity Linear programming Steiner tree problem Conservation biology Environmental impact assessment Dynamic programming Biodiversity offsetting
20	Parameterized Complexity Dichotomy for Steiner Multicut∗ Karl Bringmann† Danny Hermelin‡ Matthias Mnich§ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:47:29 NP-complete problems Graph operations Steiner tree problem Treewidth Edge contraction Graph Spanning tree Graph connectivity Minimum bottleneck spanning tree Planar separator theorem

UPDATE